The Canonical Generalized Polar Decomposition
نویسندگان
چکیده
The polar decomposition of a square matrix has been generalized by several authors to scalar products on Rn or Cn given by a bilinear or sesquilinear form. Previous work has focused mainly on the case of square matrices, sometimes with the assumption of a Hermitian scalar product. We introduce the canonical generalized polar decomposition A = WS, defined for general m × n matrices A, where W is a partial (M,N)-isometry and S is N-selfadjoint with nonzero eigenvalues lying in the open right half-plane, and the nonsingular matrices M and N define scalar products on Cm and Cn, respectively. We derive conditions under which a unique decomposition exists and show how to compute the decomposition by matrix iterations. Our treatment derives and exploits key properties of partial (M,N)-isometries and orthosymmetric pairs of scalar products, and also employs an appropriate generalized Moore–Penrose pseudoinverse. We relate commutativity of the factors in the canonical generalized polar decomposition to an appropriate definition of normality. We also consider a related generalized polar decomposition A = WS, defined only for square matrices A and in which W is an automorphism; we analyze its existence and the uniqueness of the selfadjoint factor when A is singular.
منابع مشابه
Ela on Condition Numbers for the Canonical Generalized Polar Decomposition of Real Matrices
Three different kinds of condition numbers: normwise, mixed and componentwise, are discussed for the canonical generalized polar decomposition (CGPD) of real matrices. The technique used herein is different from the ones in previous literatures of the polar decomposition. With some modifications of the definition of the componentwise condition number, its application scope is extended. Explicit...
متن کاملOn condition numbers for the canonical generalized polar decompostion of real matrices
Three different kinds of condition numbers: normwise, mixed and componentwise, are discussed for the canonical generalized polar decomposition (CGPD) of real matrices. The technique used herein is different from the ones in previous literatures of the polar decomposition. With some modifications of the definition of the componentwise condition number, its application scope is extended. Explicit...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملInterpolation on Symmetric Spaces Via the Generalized Polar Decomposition
We construct interpolation operators for functions taking values in a symmetric space—a smooth manifold with an inversion symmetry about every point. Key to our construction is the observation that every symmetric space can be realized as a homogeneous space whose cosets have canonical representatives by virtue of the generalized polar decomposition—a generalization of the well-known factorizat...
متن کاملSingular Value Decomposition and the Centrality of Löwdin Orthogonalizations
The different orthogonal relationship that exists in the Löwdin orthogonalizat ions is presented. Other orthogonalizat ion techniques such as polar decomposition (PD), principal component analysis (PCA) and reduced singular value decomposition (SVD) can be derived from Löwdin methods. It is analytically shown that the polar decomposition is presented in the symmetric o rthogonalization; princip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2010